The mean queue content of discrete-time queues with zero-regenerative arrivals
نویسندگان
چکیده
This letter investigates a single-server discrete-time queuing system with single-slot service times. For a broad class of arrival processes, a closed-form expression for the mean queue content in steady state is obtained. Apart from being stationary ergodic, the arrival process adheres to a regeneration property when there are no arrivals in a slot. Well-studied arrival processes such as autoregressive arrival processes and M/G/∞-input or train arrival processes adhere to this property.
منابع مشابه
Discrete-Time Queues with Zero-Regenerative Arrivals: Moments and Examples
In this paper we investigate a single-server discrete-time queueing system with single-slot service times. The stationary ergodic arrival process this queueing system is subject to, satisfies a regeneration property when there are no arrivals during a slot. Expressions for the mean and the variance of the queue content in steady state are obtained for this broad class which includes among other...
متن کاملAnalysis of unreliable bulk queue with statedependent arrivals
In this paper, we investigate a single-server Poisson input queueing model, wherein arrivals of units are in bulk. The arrival rate of the units is state dependent, and service time is arbitrary distributed. It is also assumed that the system is subject to breakdown, and the failed server immediately joins the repair facility which takes constant duration to repair the server. By using suppl...
متن کاملMODELLING AND ANALYSIS OF A DISCRETE-TIME PRIORITY QUEUING COMPUTER NETWORK WITH PRIORITY JUMPS USING PROBABILITY GENERATING FUNCTIONS
Priority queues have a great importance in the study of computer communication networks in which different types of traffic require different quality of service standards. The discrete-time non-preemptive priority queuing model with priority jumps is proposed in this paper. On the basis of probability generating functions mean system contents and mean queuing delay characteristics are obtained....
متن کاملA Taylor series expansions approach to queues with train arrivals
We assess the performance of a discrete-time queueing system with train arrivals. Arrivals at the queue stem from a number of active sessions, each generating a packet in a slot with fixed probability q. Since an exact analysis is not feasible for q 6= 1, we rely on Taylor-series expansions around q = 0 of the joint probability generating functions of the number of active sessions and the queue...
متن کاملOn the relationships among queue lengths at arrival, departure, and random epochs in the discrete-time queue with D-BMAP arrivals
We consider finiteand infinite-capacity queues with discrete-time batch Markovian arrival processes (D-BMAP) under the assumption of the Late Arrival System with Delayed Access as well as the Early Arrival System. Using simple arguments such as the balance equation, “rate in = rate out,” we derive relationships among the stationary queue lengths at arrival, at departure, and at random epochs. S...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Oper. Res. Lett.
دوره 40 شماره
صفحات -
تاریخ انتشار 2012